|
In mathematics, analytic combinatorics is one of the many techniques of counting combinatorial objects. It uses the internal structure of the objects to derive formulas for their generating functions and then complex analysis techniques to get asymptotics. This particular theory was mostly developed by Philippe Flajolet, and is detailed in his book with Robert Sedgewick, ''Analytic Combinatorics''. Earlier contributors to the key ideas and techniques include Leonhard Euler, Arthur Cayley, Srinivasa Ramanujan, George Pólya, and Donald Knuth. After Flajolet's death, Wojciech Szpankowski is largely responsible for further developments. Together with Jacek Cichon and Pawel Hitczenko, he created the polish school of Analytic combinatorics. == Classes of combinatorial structures == Consider the problem of distributing objects given by a generating function into a set of ''n'' slots, where a permutation group ''G'' of degree ''n'' acts on the slots to create an equivalence relation of filled slot configurations, and asking about the generating function of the configurations by weight of the configurations with respect to this equivalence relation, where the weight of a configuration is the sum of the weights of the objects in the slots. We will first explain how to solve this problem in the labelled and the unlabelled case and use the solution to motivate the creation of classes of combinatorial structures. The Pólya enumeration theorem solves this problem in the unlabelled case. Let ''f''(''z'') be the ordinary generating function (OGF) of the objects, then the OGF of the configurations is given by the substituted cycle index : In the labelled case we use an exponential generating function (EGF) ''g''(''z'') of the objects and apply the Labelled enumeration theorem, which says that the EGF of the configurations is given by : We are able to enumerate filled slot configurations using either PET in the unlabelled case or the labelled enumeration theorem in the labelled case. We now ask about the generating function of configurations obtained when there is more than one set of slots, with a permutation group acting on each. Clearly the orbits do not intersect and we may add the respective generating functions. Suppose, for example, that we want to enumerate unlabelled sequences of length two or three of some objects contained in a set ''X''. There are two sets of slots, the first one containing two slots, and the second one, three slots. The group acting on the first set is , and on the second slot, . We represent this by the following formal power series in ''X'': : where the term is used to denote the set of orbits under ''G'' and , which denotes in the obvious way the process of distributing the objects from ''X'' with repetition into the ''n'' slots. Similarly, consider the labelled problem of creating cycles of arbitrary length from a set of labelled objects ''X''. This yields the following series of actions of cyclic groups: : Clearly we can assign meaning to any such power series of quotients (orbits) with respect to permutation groups, where we restrict the groups of degree ''n'' to the conjugacy classes of the symmetric group , which form a unique factorization domain. (The orbits with respect to two groups from the same conjugacy class are isomorphic.) This motivates the following definition. A class of combinatorial structures is a formal series : where (the "A" is for "atoms") is the set of primes of the UFD and In the following we will simplify our notation a bit and write e.g. : for the classes mentioned above. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「analytic combinatorics」の詳細全文を読む スポンサード リンク
|